#include<iostream>
using namespace std;

#include"BinarySearchTree.h"
void TestBST()
{
	BSTree<int> BST;
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	for (auto e : a)
	{
		BST.Insert(e);
	}

	BST.InOrder();
}

int main()
{
	TestBST();
	return 0;
}